Autour de nouvelles notions pour l'analyse des algorithmes d'approximation: Formalisme unifié et classes d'approximation = About new notions for approximation algorithm analysis: unified formalism and approximation classesDEMANGE, Marc; PASCHOS, E. T.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 3, pp 237-277, issn 0399-0559, 41 p.Article

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation: De la structure de NPO à la structure des instances = About new notions for the approximation algorithm analysis: from thoe NPO structure to the instance structureDEMANGE, Marc; PASCHOS, Vangelis.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 4, pp 311-350, issn 0399-0559, 40 p.Article

HARDNESS OF THE UNDIRECTED CONGESTION MINIMIZATION PROBLEMANDREWS, Matthew; ZHANG, Lisa.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 112-131, issn 0097-5397, 20 p.Article

A simple algorithm for Mal'tsev constraintsBULATOV, Andrei; DALMAU, Victor.SIAM journal on computing (Print). 2007, Vol 36, Num 1, pp 16-27, issn 0097-5397, 12 p.Article

QUANTUM WALK ALGORITHM FOR ELEMENT DISTINCTNESSAMBAINIS, Andris.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 210-239, issn 0097-5397, 30 p.Article

Quantum algorithms for element distinctnessBUHRMAN, Harry; DÜRR, Christoph; HEILIGMAN, Mark et al.SIAM journal on computing (Print). 2005, Vol 34, Num 6, pp 1324-1330, issn 0097-5397, 7 p.Article

AN INTRINSICALLY NON MINIMAL-TIME MINSKY-LIKE 6-STATES SOLUTION TO THE FIRING SQUAD SYNCHRONIZATION PROBLEMYUNES, Jean-Baptiste.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 1, pp 55-68, issn 0988-3754, 14 p.Article

Improved combinatorial group testing algorithms for real-world problem suzesEPPSTEIN, David; GOODRICH, Michael T; HIRSCHBERG, Daniel S et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1360-1375, issn 0097-5397, 16 p.Article

A 2EXPTIME COMPLETE VARIETAL MEMBERSHIP PROBLEMKOZIK, Marcin.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2443-2467, issn 0097-5397, 25 p.Article

A predictive bottom-up parserJABRI, Riad.Computing (Wien. Print). 2011, Vol 92, Num 2, pp 123-167, issn 0010-485X, 45 p.Article

Recognizing binet matricesMUSITELLI, Antoine.Mathematical programming (Print). 2010, Vol 124, Num 1-2, pp 349-381, issn 0025-5610, 33 p.Conference Paper

A better list heuristic for vertex coverDELBOT, Francois; LAFOREST, Christian.Information processing letters. 2008, Vol 107, Num 3-4, pp 125-127, issn 0020-0190, 3 p.Article

FASTER AND SIMPLER ALGORITHMS FOR MULTICOMMODITY FLOW AND OTHER FRACTIONAL PACKING PROBLEMSGARG, Naveen; KÖNEMANN, Jochen.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 630-652, issn 0097-5397, 23 p.Article

A complete classification of the complexity of propositional abductionCREIGNOU, Nadia; ZANUTTINI, Bruno.SIAM journal on computing (Print). 2007, Vol 36, Num 1, pp 207-229, issn 0097-5397, 23 p.Article

ALGORITHMIC ASPECTS OF PROPERTY TESTING IN THE DENSE GRAPHS MODELGOLDREICH, Oded; RON, Dana.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 376-445, issn 0097-5397, 70 p.Article

THE PARTIAL INVERSE MINIMUM CUT PROBLEM WITH L₁-NORM IS STRONGLY NP-HARDGASSNER, Elisabeth.RAIRO. Recherche opérationnelle. 2010, Vol 44, Num 3, pp 241-249, issn 0399-0559, 9 p.Article

RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

EQUITABLE COST ALLOCATIONS VIA PRIMAL-DUAL-TYPE ALGORITHMSJAIN, Kamal; VAZIRANI, Vijay V.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 241-256, issn 0097-5397, 16 p.Article

On a generalization of addition chains : Addition-multiplication chainsBAHIG, Hatem M.Discrete mathematics. 2008, Vol 308, Num 4, pp 611-616, issn 0012-365X, 6 p.Article

Algorithms for RH mapping: New ideas and improved analysisIVANSSON, Lars; LAGERGREN, Jens.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 89-108, issn 0097-5397, 20 p.Article

Compositional competitiveness for distributed algorithmsASPNES, James; WAARTS, Orli.Journal of algorithms (Print). 2005, Vol 54, Num 2, pp 127-151, issn 0196-6774, 25 p.Article

The longest almost-increasing subsequenceELMASRY, Amr.Information processing letters. 2010, Vol 110, Num 16, pp 655-658, issn 0020-0190, 4 p.Article

Algorithm to compute the maximal abelian dimension of Lie algebrasCEBALLOS, M; NUNEZ, J; TENORIO, A. F et al.Computing (Wien. Print). 2009, Vol 84, Num 3-4, pp 231-239, issn 0010-485X, 9 p.Article

An algorithm for partitioning trees augmented with sibling edgesBORDAWEKAR, Rajesh; SHMUELI, Oded.Information processing letters. 2008, Vol 108, Num 3, pp 136-142, issn 0020-0190, 7 p.Article

IMPROVING THE STRETCH FACTOR OF A GEOMETRIC NETWORK BY EDGE AUGMENTATIONFARSHI, Mohammad; GIANNOPOULOS, Panos; GUDMUNDSSON, Joachim et al.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 226-240, issn 0097-5397, 15 p.Article